/*
 * @lc app=leetcode.cn id=674 lang=typescript
 *
 * [674] 最长连续递增序列
 */

// @lc code=start
function findLengthOfLCIS(nums: number[]): number {
    let long = 0;
    let now = 0;
    let last = -Infinity;
    nums.forEach((i) => {
        if (i > last) {
            last = i;
            now++;
        } else {
            long = Math.max(long, now);
            last = i;
            now = 1;
        }
    });
    return Math.max(long, now);
}
// @lc code=end
